On finding hypercycles in chemical reaction networks
نویسنده
چکیده
Directed hypercycles have recently been used to model chemical reaction networks. We present an NP-completeness proof for the problem of finding a hypercycle in a directed hypergraph. This sheds some light to some open questions posed by Zeigarnik [A.V. Zeigarnik, On hypercycles and hypercircuits in hypergraphs, in: Discrete Mathematical Chemistry, in: DIMACS Series in, Discrete Mathematics and Theoretical Computer Science, vol. 51, AMS, 2000, pp. 377–383] who modelled chemical reactions by directed hypergraphs. c © 2007 Elsevier Ltd. All rights reserved.
منابع مشابه
Atomoid: A New Prospect in Reaction-Formation System Spontaneous Hypercycles Guided by Dissipative Structural Properties
In this paper, we propose a reaction-formation model called "Atomoid", the reaction dynamics of which are analogous to those found in the physical world based on energy levels. Our ultimate aim is to realize an evolvable emergent system above a non-symbolic reactionformation system. To realize such a system, we construct a model of Atomoid and focus on the selfreproduction process as it is esse...
متن کاملHypergraphic Oriented Matroid Relational Dependency Flow Models of Chemical Reaction Networks
In this paper we derive and present an application of hypergraphic oriented matroids for the purpose of enumerating the variable interdependencies that define the chemical complexes associated with the kinetics of non-linear dynamical system representations of chemical kinetic reaction flow networks. The derivation of a hypergraphic oriented matroid is obtained by defining a closure operator on...
متن کاملKinetic Mechanism Reduction Using Genetic Algorithms, Case Study on H2/O2 Reaction
For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...
متن کاملSymbiosis of Spontaneous Hypercycles through Self-Compartmentation
The objective of this paper is to develop a mechanism enabling spontaneous hypercycles to coexist. Hypercycle models, arising from local interactions, are a promising approach to emergent computation because of their powerful self-organizing behavior and flexible reaction schemes. However, theoretical studies have shown that this powerful self-organizing ability fails to allow the symbiosis of ...
متن کاملRouting in Hypercycles. Deadlock Free and Backtracking Strategies
Hypercycles. is a class of multidimensional graphs, which are generalizations of the n-cube. They are obtained by allowing each dimension to incoIporate more than two elements and a cyclic interconnection strategy. Hypercycles, can be used in the design of interconnection networks for distributed systems tailored specifically to the topology of a particular application. Routing strategies, incl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Appl. Math. Lett.
دوره 21 شماره
صفحات -
تاریخ انتشار 2008